Optimizing and Matching Bitstrings
نویسنده
چکیده
Strings of bits (bitstrings) are a common first-order representation in the design and preliminary investigation of computational intelligence algorithms given (1) the ease in mapping the strings to arbitrary domains (such as real numbers), and (2) in terms of mathematical analysis. This work considers the use of bitstrings in the context of the clonal expansion and antigenic selection in a general clonal selection algorithm, and provides a general review of mutation-based optimization (genetic algorithms) and bit-string matching (classifier systems and negative selection). KeywordsBinary, String, Bit-string, Matching, Optimization, Clonal Selection Algorithm
منابع مشابه
Optimizing Disparity Candidates Space in Dense Stereo Matching
In this paper, a new approach for optimizing disparity candidates space is proposed for the solution of dense stereo matching problem. The main objectives of this approachare the reduction of average number of disparity candidates per pixel with low computational cost and high assurance of retaining the correct answer. These can be realized due to the effective use of multiple radial windows, i...
متن کاملComparative Research on Optimal Damping Matching of Seat System for an off-Highway Dump Truck
To protect the driver of off-highway dump trucks from the harmful vibration, this paper presents the comparison results to determine the optimal damping of the seat system by different optimization design plans. Three optimization schemes are considered including individually optimizing the damping of the cushion, individually optimizing the damping of the seat suspension, and integrately optim...
متن کاملMatching of Polygon Objects by Optimizing Geometric Criteria
Despite the semantic criteria, geometric criteria have different performances on polygon feature matching in different vector datasets. By using these criteria for measuring the similarity of two polygons in all matchings, the same results would not have been obtained. To achieve the best matching results, the determination of optimal geometric criteria for each dataset is considered necessary....
متن کاملOptimizing image steganography by combining the GA and ICA
In this study, a novel approach which uses combination of steganography and cryptography for hiding information into digital images as host media is proposed. In the process, secret data is first encrypted using the mono-alphabetic substitution cipher method and then the encrypted secret data is embedded inside an image using an algorithm which combines the random patterns based on Space Fillin...
متن کاملAlmost k-wise Independent Variables
We will now consider the problem of creating a set of bitstrings such that the bits are almost k-wise independent. Our method consists of two steps. In the first step we create a set of bitstrings such that parity on every fixed index set is almost even. In the second step we present a method to convert such a set into a set where the bits are almost k-wise independent. For presentational reaso...
متن کامل